Chords not required: Incorporating horizontal and vertical aspects independently in a computer improvisation algorithm
نویسندگان
چکیده
Most previous computer improvisation algorithms for tonal jazz create an output based primarily on the underlying chord progression. This approach may partly ignore melodic continuity often seen in transcriptions of traditional jazz artists. Here we suggest a different approach implemented as a computer algorithm that creates material solely based on probabilities related to past note choices. This approach aligns with theoretical work suggesting that stored motor patterns are the basis of improvised music. Our computer algorithm analyzes pitch and rhythm patterns from a given corpus and then creates improvisations using this information. We describe an example in which a corpus of 48 solos by jazz saxophonist Charlie Parker was used by our algorithm to create an improvisation of the same length. The artificial corpus contained pattern structures similar to that of the original corpus. In contrast, previous research by one of the authors showed that a chord-based computer algorithm generated an output with a pattern structure very different from that of the human improviser even though the same chord structure was used as input. Future work will add a vertical aspect to our model in which a given chord pattern influences note choices in addition to the current horizontal focus.
منابع مشابه
Numerical Investigation of Vertical and Horizontal Baffle Effects on Liquid Sloshing in a Rectangular Tank Using an Improved Incompressible Smoothed Particle Hydrodynamics Method
Liquid sloshing is a common phenomenon in the transporting of liquid tanks. Liquid waves lead to fluctuating forces on the tank wall. If these fluctuations are not predicted or controlled, they can lead to large forces and momentum. Baffles can control liquid sloshing fluctuations. One numerical method, widely used to model the liquid sloshing phenomena is Smoothed Particle Hydrodynamics (SPH)....
متن کاملDALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs
Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...
متن کاملIntegration Scheme for SINS/GPS System Based on Vertical Channel Decomposition and In-Motion Alignment
Accurate alignment and vertical channel instability play an important role in the strap-down inertial navigation system (SINS), especially in the case that precise navigation has to be achieved over long periods of time. Due to poor initialization as well as the cumulative errors of low-cost inertial measurement units (IMUs), initial alignment is not sufficient to achieve required navigation ac...
متن کاملDesign and Manipulation 3D Imaging System by using Photodiode Grid
Introduction: Radiation imaging is one of the applicable methods in diagnostic medicine and nondestructive testing for industrial applications. In nondestructive 3D imaging, in addition to the radiation source, there is a requirement for a suitable detection system, data acquisition system, mechanical sections for moving objects, reconstruction algorithm and finally a computer for processing an...
متن کاملMaximum Independent Set of a Permutation Graph in k Tracks
A maximum weighted independent set of a permutation graph is a maximum subset of noncrossing chords in a matching diagram (i.e., a set of chords with end-points on two horizontal lines). The problem of nding, among all noncrossing subsets of with density at most k, one with maximum size is considered, where the density of a subset is the maximum number of chords crossing a vertical line and k i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013